A safe-exit approach for efficient network-based moving range queries

نویسندگان

  • Duncan Yung
  • Man Lung Yiu
  • Eric Lo
چکیده

Query processing on road networks has been extensively studied in recent years. However, the processing of moving queries on road networks has received little attention. This paper studies the efficient processing of moving range queries on road networks. We formulate a network-based concept called safe exits that guarantee the query result of the client remains unchanged before the client reaches any exit. This significantly reduces the communication overhead between moving clients and the server. We then develop an efficient algorithm for computing safe exits for a client on-demand. We evaluate the proposed techniques using real road network data. Experimental results show that our algorithm constructs safe exits efficiently and they effectively reduce the communication cost.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks

A reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k closest points. In recent years, considerable research has been conducted into monitoring reverse k nearest neighbor queries. In this paper, we study the problem of continuous reverse nearest neighbor queries where both the query object q and data objects are moving. Existing state-of-the-art t...

متن کامل

A safe exit approach for continuous monitoring of reverse k-nearest neighbors in road networks

Reverse K-Nearest Neighbor (RKNN) queries in road networks have been studied extensively in recent years. However, at present, there is still a lack of algorithms for moving queries in a road network. In this paper, we study how to efficiently process moving queries. Existing algorithms do not efficiently handle query movement. For instance, whenever a query changes its location, the result of ...

متن کامل

A Safe Exit Algorithm for Moving k Nearest Neighbor Queries in Directed and Dynamic Spatial Networks

The process of moving k nearest neighbor (MkNN) queries has been studied extensively in spatial network databases. Existing state-of-the-art algorithms have focused primarily on handling MkNN queries in undirected and static spatial networks where every edge is undirected and its weight does not change over time. However, little attention has been paid to MkNN queries in directed and dynamic sp...

متن کامل

A Switchgrass-based Bioethanol Supply Chain Network Design Model under Auto-Regressive Moving Average Demand

Switchgrass is known as one of the best second-generation lignocellulosic biomasses for bioethanol production. Designing efficient switchgrass-based bioethanol supply chain (SBSC) is an essential requirement for commercializing the bioethanol production from switchgrass. This paper presents a mixed integer linear programming (MILP) model to design SBSC in which bioethanol demand is under auto-r...

متن کامل

Extending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths

Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Data Knowl. Eng.

دوره 72  شماره 

صفحات  -

تاریخ انتشار 2012